Articulated Matching with Point
نویسنده
چکیده
Articulated matching arises naturally in object recognition and tracking. When a part-based description of an object is adopted, the problem of matching the model features to the data can be decomposed into matching the parts while paying attention to overall model coherence. Here we focus on the rst part of the problem, namely, the articulated matching of a part based description of an object to unlabelled data point features. Each model part is assumed to undergo an independent aane transformation. The novel aspect of our approach is the integrated search for both the point-to-point feature correspondences and the diierent aane transformations of the parts. The result is an alternating algorithm which uses a least-squares solution for the aane parameters and the softassign technique for the correspondences. A signiicant property of the algorithm is its ability to reject missing and extra features as outliers. The algorithm is embedded in a deterministic annealing scheme. Results are shown on synthetic and real-world imagery.
منابع مشابه
Articulated motion reconstruction from feature points
A fundamental task of reconstructing non-rigid articulated motion from sequences of unstructured feature points is to solve the problem of feature correspondence and motion estimation. This problem is challenging in high-dimensional configuration spaces. In this paper, we propose a general model-based dynamic point matching algorithm to reconstruct freeform non-rigid articulated movements from ...
متن کاملLow Density Feature Point Matching for Articulated Pose Identification
We describe a general algorithm for identifying an arbitrary pose of an articulated subject with low density feature points. The algorithm aims to establish a one-to-one correspondence between two data point-sets, one representing the model of an observed subject and the other representing the pose taken from freeform motion of the subject. We avoid common assumptions such as pose similarity or...
متن کاملCorrespondence matching using kernel principal components analysis and label consistency constraints
This paper investigates spectral approaches to the problem of point pattern matching. We make two contributions. First, we consider rigid point-set alignment. Here we show how kernel principal components analysis (kernel PCA) can be effectively used for solving the rigid point correspondence matching problem when the point-sets are subject to outliers and random position jitter. Specifically, w...
متن کاملIsometry-invariant Matching of Point Set Surfaces
Shape deformations preserving the intrinsic properties of a surface are called isometries. An isometry deforms a surface without tearing or stretching it, and preserves geodesic distances. We present a technique for matching point set surfaces, which is invariant with respect to isometries. A set of reference points, evenly distributed on the point set surface, is sampled by farthest point samp...
متن کامل3D reconstruction of articulated objects from uncalibrated images
The goal of computing realistic 3-D models from image sequences is still a challenging problem. In recent years the demand for realistic reconstruction and modeling of objects and human bodies is increasing both for animation and medical applications. In this paper a system for the reconstruction of 3-D models of articulated objects, like human bodies, from uncalibrated images is presented. The...
متن کامل